Thresholds and optimal binary comparison search treesANDERSON, Richard; KANNAN, Sampath; KARLOFF, Howard et al.Lecture notes in computer science. 2001, pp 83-95, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Sparse dominance queries for many points in optimal time and spaceGRAF, T; KAMAKOTI, V.Information processing letters. 1997, Vol 64, Num 6, pp 287-291, issn 0020-0190Article

Accouplements d'arbres. Liaisons rigides de deux arbres = Shaft coupling. Rigid coupling of two shaftsVALEMBOIS, Guy.Techniques de l'ingénieur. Génie mécanique. 1992, Vol BD5, Num B5816, pp B5816.1-B5816.17, issn 1762-8768Article

Accouplements d'arbres. Accouplements élastiques = Shaft couplings. Elastic couplingsVALEMBOIS, Guy.Techniques de l'ingénieur. Génie mécanique. 1990, Vol BD5, Num B5805, pp B5805.1-B5805.14, issn 1762-8768Article

Vibration of shafts coupled by mechanismsZAJACZKOWSKI, J.Journal of sound and vibration. 1994, Vol 177, Num 5, pp 709-713, issn 0022-460XArticle

Exponentially decreasing number of operations in balanced treesJACOBSEN, Lars; LARSEN, Kim S.Lecture notes in computer science. 2001, pp 293-311, issn 0302-9743, isbn 3-540-42672-8Conference Paper

A note on decision versus search for graph automorphismAGRAWAL, M; ARVIND, V.Information and computation (Print). 1996, Vol 131, Num 2, pp 179-189, issn 0890-5401Article

Single and bulk updates in stratified trees: An amortized and worst-case analysisSOISALON-SOININEN, Eljas; WIDMAYER, Peter.Computer science in perspective (essays dedicated to Thomas Ottmann). Lecture notes in computer science. 2003, pp 278-292, issn 0302-9743, isbn 3-540-00579-X, 15 p.Book Chapter

Learning a go heuristic with TILDERAMON, Jan; FRANCIS, Tom; BLOCKEEL, Hendrik et al.Lecture notes in computer science. 2001, pp 151-169, issn 0302-9743, isbn 3-540-43080-6Conference Paper

Synthèse d'images figuratives d'arbres par des méthodes combinatoires = Some combinatorial methods for the tree image synthesisEYROLLES, Georges; CORI, Robert.1986, 84 p.-56 p. de plThesis

Alternating automata with start formulasMOSTOWSKI, A. W.Information processing letters. 1990, Vol 35, Num 6, pp 287-290, issn 0020-0190, 4 p.Article

I/O-Efficient shortest path queries in geometric spannersMAHESHWARI, Anil; SMID, Michiel; ZEH, Norbert et al.Lecture notes in computer science. 2001, pp 287-299, issn 0302-9743, isbn 3-540-42423-7Conference Paper

More than tree dimensions: inter-lineage evolution's ecological importanceMCINERNEY, James O.Trends in ecology & evolution (Amsterdam). 2013, Vol 28, Num 11, pp 624-625, issn 0169-5347, 2 p.Article

A reality check for alignments and treesMARTIN, William; ROETTGER, Mayo; LOCKHART, Peter J et al.Trends in genetics (Regular ed.). 2007, Vol 23, Num 10, pp 478-480, issn 0168-9525, 3 p.Article

Using concept taxonomies for effective tree inductionHONG YAN YI; DE LA IGLESIA, B; RAYWARD-SMITH, V. J et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30818-0, 2Vol, Part 2, 1011-1016Conference Paper

Learning of class descriptions from class discriminations: A hybrid approach for relational objectsGEIBEL, Peter; SCHÄDLER, Kristina; WYSOTZKI, Fritz et al.Lecture notes in computer science. 2002, pp 186-201, issn 0302-9743, isbn 3-540-44185-9, 16 p.Conference Paper

EHBT : An efficient protocol for group key managementRAFAELI, Sandro; MATHY, Laurent; HUTCHISON, David et al.Lecture notes in computer science. 2001, pp 159-171, issn 0302-9743, isbn 3-540-42824-0Conference Paper

Combine fault and event trees for safety analysisCHRISTIAN, J. B.Chemical engineering progress. 1997, Vol 93, Num 4, pp 72-75, issn 0360-7275Article

The joint sum of graceful treesDE-JUN JIN; SI-ZHANG LIU; SANG-HO LEE et al.Computers & mathematics with applications (1987). 1993, Vol 26, Num 10, pp 83-87, issn 0898-1221Article

The radical product of graceful treesSI-ZHANG LIU; DE-JUN JIN; SANG-HO LEE et al.Computers & mathematics with applications (1987). 1993, Vol 26, Num 10, pp 89-93, issn 0898-1221Article

On the Deque conjecture for the Splay algorithmRAJAMANI SUNDAR.Combinatorica (Print). 1992, Vol 12, Num 1, pp 95-124, issn 0209-9683Article

On the largest tree of given maximum degree in a connected graphCARO, Y; KRASIKOV, I; RODITTY, Y et al.Journal of graph theory. 1991, Vol 15, Num 1, pp 7-13, issn 0364-9024Article

A tutte polynomial for signed graphsKAUFFMAN, L. H.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 105-127, issn 0166-218X, 23 p.Article

Maximum and k-Th maximal spanning trees of a weighted graphKANO, M.Combinatorica (Print). 1987, Vol 7, Num 2, pp 205-214, issn 0209-9683Article

Efficient algorithms for finding minimum spanning trees in undirected and directed graphsGABOW, H. N; GALIL, Z; SPENCER, T et al.Combinatorica (Print). 1986, Vol 6, Num 2, pp 109-122, issn 0209-9683Article